Cuckoo search via Levy flights applied to uncapacitated facility location problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the uncapacitated facility location problem using tabu search

A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. Tabu search is used to guide the solution process when evolving from one solution to another. A move is defined to be the opening or closing of a facility. The net cost change resulting from a candidate move is used to measure the attractiveness of the move. After a move is made, the net cost ch...

متن کامل

Cuckoo search via Lévy flights for the capacitated vehicle routing problem

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

متن کامل

Neighborhood search heuristics for the uncapacitated facility location problem

The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications of neighborhood search methods to this problem have not been reported in the literature. In this paper we first describe and compare several neighborhood structures used by lo...

متن کامل

Uncapacitated Metric Facility Location Problem (umfl)

• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an ass...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial Engineering International

سال: 2017

ISSN: 1735-5702,2251-712X

DOI: 10.1007/s40092-017-0248-0